Applying DBR and MAS to Solving Container Loading Problem
نویسندگان
چکیده
منابع مشابه
Applying Tabu Search to Container Loading Problems
This paper presents a Tabu Search Algorithm (TSA) for container loading problems with a container to be loaded. The TSA is based on a two-stage procedural approach. While alternative stowing plans are generated directly using an integrated greedy heuristic, the execution of the heuristic is controlled by means of a superior Tabu Search. The TSA considers several restrictions of practical releva...
متن کاملA Tree Search Algorithm for Solving the Container Loading Problem
The paper presents a tree search algorithm for the three-dimensional container loading problem (3D-CLP). The 3D-CLP is the problem of loading a subset of a given set of rectangular boxes into a rectangular container so that the packed volume is maximized. The method has two variants: the packing variant guarantees full support from below for all packed boxes, while this constraint is not taken ...
متن کاملAlgorithms for the Container Loading Problem
In this paper we consider the three-dimensional problem of optimal packing of a container with rectangular pieces. We propose an approximation algorithm based on the "forward state strategy" of dynamic programming. A suitable description of packings is developed for the implementation of the approximation algorithm, and some computational experience is reported. Zusammenfassung: Zur nn aherungs...
متن کاملHeuristics for the container loading problem
The knapsack container loading problem is the problem of loading a subset of rectangular boxes into a rectangular container of fixed dimensions such that the volume of the packed boxes is maximized. A new heuristic based on the wall-building approach is proposed, which decomposes the problem into a number of layers which again are split into a number of strips. The packing of a strip may be for...
متن کاملSolving the 3D Container Ship Loading Planning Problem by Representation by Rules and Beam Search
This paper formulates the 3D Container ship Loading Planning Problem (3D CLPP) and also proposes a new and compact representation to efficiently solve it. Containers on board a Container ship are placed in vertical stacks, located in different sections. The only way to access the containers is through the top of the stack. In order to unload a container at a given port j, it is necessary to rem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Japan Society for Fuzzy Theory and Intelligent Informatics
سال: 2006
ISSN: 1881-7203,1347-7986
DOI: 10.3156/jsoft.18.837